By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 33, Issue 2, pp. 261-503

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection

Refael Hassin and Asaf Levin

pp. 261-268

BibTeX  Abstract Full Text:  PDF

Shape Fitting with Outliers

Sariel Har-Peled and Yusu Wang

pp. 269-285

BibTeX  Abstract Full Text:  PDF

New Stability Results for Adversarial Queuing

Zvi Lotker, Boaz Patt-Shamir, and Adi Rosén

pp. 286-303

BibTeX  Abstract Full Text:  PDF

On Identifying Codes in the Triangular and Square Grids

Iiro Honkala and Tero Laihonen

pp. 304-312

BibTeX  Abstract Full Text:  PDF

A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols

Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, and Mike Paterson

pp. 313-331

BibTeX  Abstract Full Text:  PDF

Stackelberg Scheduling Strategies

Tim Roughgarden

pp. 332-350

BibTeX  Abstract Full Text:  PDF

Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width

Georg Gottlob and Reinhard Pichler

pp. 351-378

BibTeX  Abstract Full Text:  PDF

The Minimum All-Ones Problem for Trees

William Y. C. Chen, Xueliang Li, Chao Wang, and Xiaoyan Zhang

pp. 379-392

BibTeX  Abstract Full Text:  PDF

Scheduling with AND/OR Precedence Constraints

Rolf H. Möhring, Martin Skutella, and Frederik Stork

pp. 393-415

BibTeX  Abstract Full Text:  PDF

The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random

Leslie Ann Goldberg, Steven Kelk, and Mike Paterson

pp. 416-432

BibTeX  Abstract Full Text:  PDF

The Potential of the Approximation Method

Kazuyuki Amano and Akira Maruoka

pp. 433-447

BibTeX  Abstract Full Text:  PDF

Algorithms for Data Migration with Cloning

Samir Khuller, Yoo-Ah Kim, and Yung-Chun (Justin) Wan

pp. 448-461

BibTeX  Abstract Full Text:  PDF

An Optimal Competitive Strategy for Walking in Streets

Christian Icking, Rolf Klein, Elmar Langetepe, Sven Schuierer, and Ines Semrau

pp. 462-486

BibTeX  Abstract Full Text:  PDF

Learning a Hidden Matching

Noga Alon, Richard Beigel, Simon Kasif, Steven Rudich, and Benny Sudakov

pp. 487-501

BibTeX  Abstract Full Text:  PDF

On Rational Number Reconstruction and Approximation

Victor Y. Pan and Xinmao Wang

pp. 502-503

BibTeX  Abstract Full Text:  PDF